Theory Of Computation+UnSolved

Friday, January 24, 2020

Two finite state machines are said to be equivalent only if they

Ahave the same number of states

Bhave the same number of edges

Chave the same number of states and also the same number of edges

Drecognise the same set of tokens.

View Answer

Which of the following statements is wrong ?

AAny regular language has an equivalent CFG

BSome non-regular languages cannot be generated by any CFG

CIntersection of a context free language and a regular language is always context free

DAll languages can be generated by CFGs.

View Answer

P, Q, R are three languages. PQ = R and P and R are regular. This implies

AQ has to be regular

BQ cannot be regular

CQ need not be regular

DQ cannot be a CFL

View Answer